Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Ant Colony Optimization and Aggressive Local Search applied to Bin Packing and Cutting Stock Problems John Levine and Frederick Ducatelle

Source URL: www.aiai.ed.ac.uk

APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Source URL: www.cse.iitd.ac.in

Elliptic PDEs, vibrations of a plate, set discrepancy and packing problems Stefan Steinerberger Mathematisches Institut Universit¨ at Bonn

Source URL: www.mathematik.uni-kl.de

CPS296.2 Geometric Optimization March, Lecture 17: Covering, Packing, and Art-Gallery Problems Lecturer: Pankaj K. Agarwal

Source URL: www.cs.duke.edu

Multi-dimensional Bin Packing Problems with Guillotine Constraints Rasmus R. Amossen∗ David Pisinger†

Source URL: rasmus.resen.org

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003

Source URL: www.cs.berkeley.edu

• NP-complete problems
• Complexity classes
• Bin packing problem
• NP
• Subset sum problem
• Partition problem
• Vertex cover
• Integer
• 3-partition problem
• Theoretical computer science
• Mathematics
• Computational complexity theory

A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

Source URL: ccom.uprrp.edu

• NP-complete problems
• Combinatorics
• Analysis of algorithms
• Set packing
• Randomized algorithm
• Disjoint-set data structure
• Parameterized complexity
• Set cover problem
• Dominating set
• Theoretical computer science
• Computational complexity theory
• Mathematics

16th Canadian Conference on Computational Geometry, 2004 On Computing Enclosing Isosceles Triangles and Related Problems
 Prosenjit Bose

Source URL: www.cccg.ca

• Circles
• Triangle
• Circle packing in an isosceles right triangle
• Packing problem
• Geometry
• Triangles
• Triangle geometry